Optimal partial shape similarity

نویسندگان

  • Longin Jan Latecki
  • Rolf Lakämper
  • Diedrich Wolter
چکیده

Humans are able to recognize objects in the presence of significant amounts of occlusion and changes in the view angle. In human and robot vision, these conditions are normal situations and not exceptions. In digital images one more problem occurs due to unstable outcomes of the segmentation algorithms. Thus, a normal case is that a given shape is only partially visible, and the visible part is distorted. To our knowledge there does not exist a shape representation and similarity approach that could work under these conditions. However, such an approach is necessary to solve the object recognition problem. The main contribution of this paper is the definition of an optimal partial shape similarity measure that works under these conditions. In particular, the presented novel approach to shape-based object recognition works even if only a small part of a given object is visible and the visible part is significantly distorted, assuming the visible part is distinctive. q 2004 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Partial Shape Matching of Outer Contours

This paper introduces a novel efficient partial shape matching method named IS-Match. We use sampled points from the silhouette as a shape representation. The sampled points can be ordered which in turn allows to formulate the matching step as an order-preserving assignment problem. We propose an angle descriptor between shape chords combining the advantages of global and local shape descriptio...

متن کامل

IS-Match: Partial Shape Matching by Efficiently Solving an Order Preserving Assignment Problem

This paper introduces a novel efficient partial shape matching method named IS-Match. We use sampled points from the silhouette as a shape representation. The sampled points can be ordered which in turn allows to formulate the matching step as an order-preserving assignment problem. We propose an angle descriptor between shape chords combining the advantages of global and local shape descriptio...

متن کامل

A Partial Shape Matching Method for 3d Model Databases

The use of 3D models is gaining popularity since they are important for computer graphics applications. Recently, similarity retrieval techniques for 3D models have been investigated intensively for handling databases of 3D models systematically. The techniques extract shape descriptors from 3D models and use these descriptors for indices for comparing shape similarities. Various shape descript...

متن کامل

Probabilistic matching of sets of polygonal curves∗

Analysis and comparison of geometric shapes are of importance in various application areas within computer science, e.g., pattern recognition and computer vision. The general situation in a shape matching problem is that we are given two shapes A and B and a certain class T of allowable transformations and we want to transform B optimally so that the transformed image of B is as close to A as p...

متن کامل

Persistent homology and partial similarity of shapes

The ability to perform shape retrieval based not only on full similarity, but also partial similarity is a key property for any content-based search engine. We prove that persistence diagrams can reveal a partial similarity between two shapes by showing a common subset of points. This can be explained using the MayerVietoris formulas that we develop for ordinary, relative and extended persisten...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Image Vision Comput.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2005